Convergence Acceleration Techniques for Non-Hermitian SCF Problems

نویسنده

  • PEDRO SALVADOR
چکیده

Conventional convergence acceleration techniques for the SCF procedure like the direct inversion in the iterative subspace and the level-shifting can not be applied in the general case of non-Hermitian Fock operators. The commutator of the Fock matrix and the density matrix do not vanish upon convergence of nonHermitian SCF equations and hence the usual error vector choice is not applicable. In this work we describe in detail the implementation of these convergence acceleration techniques for the non-Hermitian case. We focus in particular in the solution of the CHA-SCF equations (arising from the application of the chemical Hamiltonian approach at the Hartree–Fock level of theory), but it can be generalized to any non-Hermitian SCF problem. It is shown that a general commutation relationship combining the right and left eigenvectors of the Fock matrix is appropriate as error vector. In a similar fashion, level-shifting techniques of the virtual orbitals can be easily implemented as well. © 2009 Wiley Periodicals, Inc. Int J Quantum Chem 109: 2564–2571, 2009

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparison of acceleration techniques of analytical methods for solving differential equations of integer and fractional order

The work  addressed in this paper is a comparative study between convergence of the  acceleration techniques, diagonal pad'{e} approximants and shanks transforms, on Homotopy analysis method  and Adomian decomposition method for solving  differential equations of integer and fractional orders.

متن کامل

Subspace acceleration for the Crawford number and related eigenvalue optimization problems

This paper is concerned with subspace acceleration techniques for computing the Crawford number, that is, the distance between zero and the numerical range of a matrix A. Our approach is based on an eigenvalue optimization characterization of the Crawford number. We establish local convergence of order 1 + √ 2 ≈ 2.4 for an existing subspace method applied to such and other eigenvalue optimizati...

متن کامل

Arnoldi-Faber method for large non hermitian eigenvalue problems

We propose a restarted Arnoldi’s method with Faber polynomials and discuss its use for computing the rightmost eigenvalues of large non hermitian matrices. We illustrate, with the help of some practical test problems, the benefit obtained from the Faber acceleration by comparing this method with the Chebyshev based acceleration. A comparison with the implicitly restarted Arnoldi method is also ...

متن کامل

Acceleration Techniques for Newton's Non-linear Iterative Scheme Acceleration Techniques for Newton's Non-linear Iterative Scheme Acceleration Techniques for Newton's Non-linear Iterative Scheme

The solution of non-linear sets of algebraic equations is usually obtained by the Newton's method, exhibiting quadratic convergence. For practical simulations, a signiicant computational eeort consists in the evaluation of the Jacobian matrices. In this paper, we propose and experiment various methods to speed the convergence process either by re-using information from previous iterates or by b...

متن کامل

Convergence Properties of Hermitian and Skew Hermitian Splitting Methods

In this paper we consider the solutions of linear systems of saddle point problems‎. ‎By using the spectrum of a quadratic matrix polynomial‎, ‎we study the eigenvalues of the iterative matrix of the Hermitian and skew Hermitian splitting method‎.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009